Adaptive Randomness: A New Population Initialization Method
نویسندگان
چکیده
منابع مشابه
A novel population initialization method for accelerating evolutionary algorithms
Population initialization is a crucial task in evolutionary algorithms because it can affect the convergence speed and also the quality of the final solution. If no information about the solution is available, then random initialization is the most commonly used method to generate candidate solutions (initial population). This paper proposes a novel initialization approach which employs opposit...
متن کاملDEVELOPING A NEW INITIALIZATION PROCEDURE FOR DISTILLATION COLUMN SIMULATION
The simulation of distillation columns is an essential step in design, optimization, and rating. In this paper, a new procedure has been proposed for the initial estimation of column profiles based on modified Kremser’s group method for simple and/or complex columns. The effect of this initialization algorithm on simulation procedure has been studied through two examples. The results show sig...
متن کاملsolution of security constrained unit commitment problem by a new multi-objective optimization method
چکیده-پخش بار بهینه به عنوان یکی از ابزار زیر بنایی برای تحلیل سیستم های قدرت پیچیده ،برای مدت طولانی مورد بررسی قرار گرفته است.پخش بار بهینه توابع هدف یک سیستم قدرت از جمله تابع هزینه سوخت ،آلودگی ،تلفات را بهینه می کند،و هم زمان قیود سیستم قدرت را نیز برآورده می کند.در کلی ترین حالتopf یک مساله بهینه سازی غیر خطی ،غیر محدب،مقیاس بزرگ،و ایستا می باشد که می تواند شامل متغیرهای کنترلی پیوسته و گ...
A new initialization method for neural networks using sensitivity analysis
The learning methods for feedforward neural networks find the network’s optimal parameters through a gradient descent mechanism starting from an initial state of the parameters. This initial state influences both in convergence speed and the error that finally is achieved. In this paper, we present a sensitivity analysis based initialization method for two-layer feedforward neural networks, whi...
متن کاملA new initialization method for categorical data clustering
In clustering algorithms, choosing a subset of representative examples is very important in data set. Such ''exemplars " can be found by randomly choosing an initial subset of data objects and then iteratively refining it, but this works well only if that initial choice is close to a good solution. In this paper, based on the frequency of attribute values, the average density of an object is de...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Problems in Engineering
سال: 2014
ISSN: 1024-123X,1563-5147
DOI: 10.1155/2014/975916